HRank: A Path Based Ranking Method in Heterogeneous Information Network

نویسندگان

  • Yitong Li
  • Chuan Shi
  • Philip S. Yu
  • Qing Chen
چکیده

Recently, there is a surge of interests on heterogeneous information network analysis. Although evaluating the importance of objects has been well studied in homogeneous networks, it is not yet exploited in heterogeneous networks. In this paper, we study the ranking problem in heterogeneous networks and propose the HRank method to evaluate the importance of multiple types of objects and meta paths. A constrained meta path is proposed to subtly capture the rich semantics in heterogeneous networks. Since the importance of objects depends upon the meta paths in heterogeneous networks, HRank develops a path based random walk process. Furthermore, HRank can simultaneously determine the importance of objects and meta paths through applying the tensor analysis. Experiments on three real datasets show that HRank can effectively evaluate the importance of objects and paths together. Moreover, the constrained meta path shows its potential on mining subtle semantics by obtaining more accurate ranking results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HRank: A Path based Ranking Framework in Heterogeneous Information Network

Recently, there is a surge of interests on heterogeneous information network analysis. As a newly emerging network model, heterogeneous information networks have many unique features (e.g., complex structure and rich semantics) and a number of interesting data mining tasks have been exploited in this kind of networks, such as similarity measure, clustering, and classification. Although evaluati...

متن کامل

Feature Selection on Heterogeneous Graph

Heterogeneous graph based information recommendation have been proved useful in recent studies. Given a heterogeneous graph scheme, there are many possible meta paths between the query node and the result node, and each meta path addresses a hypothesis-based ranking function. In prior researches, meta paths are manually selected by domain experts. However, when the graph scheme becomes complex,...

متن کامل

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

متن کامل

Improvement of the mechanism of congestion avoidance in mobile networks

Mobile ad hoc network congestion control is a significant problem. Standard mechanism for congestion control (TCP), the ability to run certain features of a wireless network, several mutations are not common. In particular, the enormous changes in the network topology and the joint nature of the wireless network. It also creates significant challenges in mobile ad hoc networks (MANET), density ...

متن کامل

The Use of Fuzzy, Neural Network, and Adaptive Neuro-Fuzzy Inference System (ANFIS) to Rank Financial Information Transparency

Ranking of a company's financial information is one of the most important tools for identifying strengths and weaknesses and identifying opportunities and threats outside the company. In this study, it is attempted to examine the financial statements of companies to rank and explain the transparency of financial information of 198 companies during 2009-2017 using artificial intelligence and neu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014